The interval number of a planar graph is at most three

The interval number of a graph G is the minimum k such that one can assign to each vertex union intervals on real line, intersection these sets, i.e., two vertices are adjacent in if and only corresponding sets have non-empty intersection. Scheinerman West (1983) [14] proved any planar at most 3. However original proof has flaw. We give different shorter this result.